Bounds on Co-Independent Liar’s Domination in Graphs
نویسندگان
چکیده
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملBounds on the outer-independent double Italian domination number
An outer-independent double Italian dominating function (OIDIDF)on a graph $G$ with vertex set $V(G)$ is a function$f:V(G)longrightarrow {0,1,2,3}$ such that if $f(v)in{0,1}$ for a vertex $vin V(G)$ then $sum_{uin N[v]}f(u)geq3$,and the set $ {uin V(G)|f(u)=0}$ is independent. The weight ofan OIDIDF $f$ is the value $w(f)=sum_{vin V(G)}f(v)$. Theminimum weight of an OIDIDF on a graph $G$ is cal...
متن کاملTotal Co-Independent Domination in Graphs
A set D of vertices in a graph G is a dominating set if every vertex in V −D is adjacent to some vertex in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. A dominating set D of a graph G is total dominating set if the induced subgraph 〈D〉 has no isolated vertices. In this paper, we introduce the total co-independent domination in graphs, exact value for some s...
متن کاملBounds on Global Total Domination in Graphs
A subset S of vertices in a graph G is a global total dominating set, or just GTDS, if S is a total dominating set of both G and G. The global total domination number γgt(G) of G is the minimum cardinality of a GTDS of G. We present bounds for the global total domination number in graphs.
متن کاملBounds on neighborhood total domination in graphs
In this paper, we continue the study of neighborhood total domination in graphs first studied by Arumugam and Sivagnanam [S. Arumugam, C. Sivagnanam, Neighborhood total domination in graphs, Opuscula Math. 31 (2011) 519–531]. A neighborhood total dominating set, abbreviated NTD-set, in a graph G is a dominating set S in G with the property that the subgraph induced by the open neighborhood of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2021
ISSN: 2314-4785,2314-4629
DOI: 10.1155/2021/5544559